The nomore++ System

نویسندگان

  • Christian Anger
  • Martin Gebser
  • Thomas Linke
  • André Neumann
  • Torsten Schaub
چکیده

We present a new answer set solver nomore++. Distinguishing features include its treatment of heads and bodies equitably as computational objects and a new hybrid lookahead. nomore++ is close to being competitive with stateof-the-art answer set solvers, as demonstrated by selected experimental results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NoMoRe : Non-monotonic Reasoning with Logic Programs

The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [6, 8, 7] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflec...

متن کامل

nomore<: A System for Computing Preferred Answer Sets

The integration of preferences into Answer Set Programming (ASP) constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. Up to now, the preference semantics we are considering in this system description were incorporated into answer set solvers either by meta-interpretation [3] or by pre-compilation front-ends [2]; therefore, such kind...

متن کامل

Profiling Answer Set Programming: The Visualization Component of the noMoRe System

Standard debugging techniques, like sequential tracing, fail in answer set programming due to its purely declarative approach. We address this problem by means of the graph-oriented computational model underlying the noMoRe system. Although this is no generic solution, it offers a way to make the computation of answer sets transparent within the noMoRe framwork. Apart from the visualization of ...

متن کامل

More on noMoRe

Thomas Linke, Christian Anger, and Kathrin Konczak Universität Potsdam, Institut für Informatik, linke,canger,konczak @cs.uni-potsdam.de Abstract. This paper focuses on the efficient computation of answer sets for normal logic programs. It concentrates on a recently proposed rule-based method (implemented in the noMoRe system) for computing answer sets. We show how noMoRe and its underlying met...

متن کامل

NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics

The noMoRe system (first prototype) implements answer set semantics for propositional normal logic programs. It uses an alternative implementation paradigm to compute answer sets by computing non-standard graph colorings of labeled directed graphs associated with logic programs. Therefore noMoRe is an interesting experimental tool for scientists working with logic programs on a theoretical or p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005